A Bijective Proof of a Factorization Formula for Macdonald Polynomials at Roots of Unity
نویسندگان
چکیده
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials H̃λ(X ; q, t) when t is specialized at a primitive root of unity. Our proof is restricted to the special case where λ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of H̃λ(X ; q, t) on the monomial basis.
منابع مشابه
A Bijective Proof of a Factorization Formula for Specialized Macdonald Polynomials
Let μ and ν = (ν1, . . . , νk) be partitions such that μ is obtained from ν by adding m parts of size r. Descouens and Morita proved algebraically that the modified Macdonald polynomials H̃μ(X; q, t) satisfy the identity H̃μ = H̃νH̃(rm) when the parameter t is specialized to an mth root of unity. Descouens, Morita, and Numata proved this formula bijectively when r ≤ νk and r ∈ {1, 2}. This note giv...
متن کاملFactorization formulas for MacDonald polynomials
In [LLT1], Lascoux, Leclerc and Thibon give some factorisation formulas for Hall-Littlewood functions when the parameter q is specialized at roots of unity. They also give formulas in terms of cyclic characters of the symmetric group. In this article, we give a generalization of these specializations for different versions of the Macdonald polynomials and we obtain similar formulas in terms of ...
متن کاملMacdonald polynomials at roots of unity
The aim of this note is to give some factorisation formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those given in [LLT1] for Hall-Littlewood functions. Résumé. Le but de cette note est de donner quelques formules de factorisations pour différentes versions des polynômes de Macdonald lorsque le paramètre t est spéci...
متن کاملGreen polynomials at roots of unity and its application
We consider Green polynomials at roots of unity. We obtain a recursive formula for Green polynomials at appropriate roots of unity, which is described in a combinatorial manner. The coefficients of the recursive formula are realized by the number of permutations satisfying a certain condition, which leads to interpretation of a combinatorial property of certain graded modules of the symmetric g...
متن کاملA formula of Lascoux-Leclerc-Thibon and representations of symmetric groups
We consider Green polynomials at roots of unity, corresponding to partitions which we call l-partitions. We obtain a combinatorial formula for Green polynomials corresponding to l-partitions at primitive lth roots of unity. The formula is rephrased in terms of representation theory of the symmetric group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008